A k-Nearest Neighbor Search Algorithm for Enhancing Data Privacy in Outsourced Spatial Databases

نویسندگان

  • Miyoung Jang
  • Min Yoon
  • Jae-Woo Chang
چکیده

With the advancement of cloud computing technologies and the propagation of locationbased services, research on outsourced spatial databases has been spotlighted. Therefore, the traditional spatial databases owners want to outsource their resources to a service provider so that they can reduce cost for storage and management. However, the issue of privacy preservation is crucial in spatial database outsourcing since user location data is sensitive against unauthorized accesses. Existing privacy-preserving query processing algorithms encrypt spatial database and perform a query on encrypted data. Nevertheless, the existing algorithms may reveal the original database from encrypted database and the query processing algorithms fall short in offering query processing on road networks. In this paper, we propose a privacy-preserving query processing algorithm which performs on encrypted spatial database. A new node-anchor index is designed to reduce unnecessary network expansions for retrieving k-nearest neighbor (k-NN) objects from a query point. Performance analysis shows that our k-NN query processing algorithm outperforms the existing algorithm in terms of query processing time and the size of candidate result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A k-Nearest Neighbor Search Algorithm for Privacy Preservation in Outsourced Spatial Databases

Traditional spatial databases owners outsource their resources to a cloud computing environment so that they can reduce cost for storage and management. However, the issue of privacy preservation is crucial in spatial database outsourcing since user location data is sensitive against unauthorized accesses. Existing privacy-preserving algorithms may reveal the original database from encrypted da...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases

Outsourcing data to third party data providers is becoming a common practice for data owners to avoid the cost of managing and maintaining databases. Meanwhile, due to the popularity of locationbased-services (LBS), the need for spatial data (e.g., gazetteers, vector data) is increasing exponentially. Consequently, we are witnessing a new trend of outsourcing spatial datasets by data collectors...

متن کامل

A query integrity assurance scheme for accessing outsourced spatial databases

With the trend of cloud computing, outsourcing databases to third party service providers is becoming a common practice for data owners to decrease the cost of managing and maintaining databases in-house. In conjunction, due to the popularity of location-based-services (LBS), the need for spatial data (e.g., gazetteers, vector data) is increasing dramatically. Consequently, there is a noticeabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013